Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
نویسندگان
چکیده
We study the problem of finding a length-constrained maximum-density path in a tree with weight and length on each edge. This problem was proposed in [R.R. Lin, W.H. Kuo, K.M. Chao, Finding a length-constrained maximum-density path in a tree, Journal of Combinatorial Optimization 9 (2005) 147–156] and solved in O(nU ) time when the edge lengths are positive integers, where n is the number of nodes in the tree andU is the length upper bound of the path. We present an algorithm that runs in O(n log2 n) time for the generalized case when the edge lengths are positive real numbers, which indicates an improvement when U = Ω(log2 n). The complexity is reduced to O(n log n) when edge lengths are uniform. In addition, we study the generalized problems of finding a length-constrained maximum-sum or maximum-density subtree in a given tree or graph, providing algorithmic and complexity results. c © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
An improved algorithm for finding a length-constrained maximum-density subtree in a tree
Given a tree T with weight and length on each edge, as well as a lower bound L and an upper bound U , the so-called length-constrained maximum-density subtree problem is to find a maximum-density subtree in T such that the length of this subtree is between L and U . In this study, we present an algorithm that runs in O(nU log n) time for the case when the edge lengths are positive integers, whe...
متن کاملAlgorithms for the Problems of Length-Constrained Heaviest Segments
We present algorithms for length-constrained maximum sum segment and maximum density segment problems, in particular, and the problem of finding length-constrained heaviest segments, in general, for a sequence of real numbers. Given a sequence of n real numbers and two real parameters L and U (L 6 U), the maximum sum segment problem is to find a consecutive subsequence, called a segment, of len...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملAlgorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence
In this work, we obtain the following new results: – Given a tree T = (V, E) with a length function ` : E → R and a weight function w : E → R, a positive integer k, and an interval [L, U ], the Weight-Constrained k Longest Paths problem is to find the k longest paths among all paths in T with weights in the interval [L,U ]. We show that the Weight-Constrained k Longest Paths problem has a lower...
متن کاملKaikoura Information Processing Letters tree theorems : Computing the maximum agreement subtree
The Maximum Agreement Subtree Problem was posed by Finden and Gordon in 1985, and is as follows: given a set S={s,, sz,..., s,,} and two trees P and Q leaf-labelled by the elements of S, find a maximum cardinality subset S, of S such that PI S, = Q IS,. This problem arises in evolutionary tree construction, where different methods or data yield (possibly) different trees for the same species on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Optimization
دوره 3 شماره
صفحات -
تاریخ انتشار 2006